On the Glivenko-Cantelli Problem in Stochastic Programming: Linear Recourse and Extensions

Integrals of optimal values of random optimization problems depending on a nite dimensional parameter are approximated by using empirical distributions instead of the original measure. Under fairly broad conditions, it is proved that uniform convergence of empirical approximations of the right hand sides of the constraints implies uniform convergence of the optimal values in the linear and convex case.